Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets
نویسندگان
چکیده
منابع مشابه
Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملFirst order optimality conditions for generalized semi-infinite programming problems
In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...
متن کاملQuantitative Stability and Optimality Conditions in Convex Semi-Infinite and Infinite Programming
This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T . Parameter perturbations on the right-hand side of the inequalities are measurable and bounded, and thus the natural parameter space is l∞(T ). Based on ad...
متن کاملOn strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem with vanishing constraints (MOSIPVC). We introduce stationary conditions for the MOSIPVCs and establish the strong Karush-Kuhn-Tucker type sufficient optimality conditions for the MOSIPVC under generalized convexity assumptions.
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2017
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-017-1150-z